Distributed sorting

Distributed Sorting

Hph7 -0 Distributed Sorting Revisited

In this paper we present a new algorithm for distributed sorting. The algorithm solves the same problem as 0] but uses a more general network topology. The development of the algorithm was inspired by 1]. 1. The problem Given is a collection of N nonempty bags of numbers (b i : 0 i < N). We are required to write a distributed program that establishes (8i : 0 < i < N : max(b i?1) min(b i)) with ...

Optimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II

The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...

Fast Sorting on a Distributed-Memory Architecture

We consider the often-studied problem of sorting, for a parallel computer. Given an input array distributed evenly over p processors, the task is to compute the sorted output array, also distributed over the p processors. Many existing algorithms take the approach of approximately load-balancing the output, leaving each processor with Θ( p ) elements. However, in many cases, approximate load-ba...

The Round Complexity of Distributed Sorting

We consider the model of fully connected networks, where in each round each node can send an O(logn)-bit message to each other node (this is the congest model with diameter 1). It is known that in this model, min-weight spanning trees can be found in O(log logn) rounds. In this paper we show that distributed sorting, where each node has at most n items, can be done in time O(log log n) as well....